منابع مشابه
The square lattice shuffle, correction
1. A CORRECTION Theorem 3.6 in [1] contains an error in the stated bound. As is argued above the theorem, the statistical distance to the uniform distribution decreases by a factor O ( (m/ log m)−1/2 ) = O ((log n)1/2n−1/4) for every two iterations. This implies that the bound obtained for Theorem 3.6 should read O ( n1− t−1 2 1 4 (log n) t−1 2 1 2 ) . I am grateful to Justin Holmgren for point...
متن کاملThe square lattice shuffle
We show that the operations of permuting columns and rows separately and independently mix a square matrix in constant time.
متن کاملFolding the Square - Diagonal Lattice
We study the problem of " phantom " folding of the two-dimensional square lattice, in which the edges and diagonals of each face can be folded. The non-vanishing thermodynamic folding entropy per face s ≃ .2299(1) is estimated both analytically and numerically, by successively mapping the model onto a dense loop model, a spin model and a new 28 Vertex, 4-color model. Higher dimensional generali...
متن کاملThe hexagonal versus the square lattice
Schmutz Schaller’s conjecture regarding the lengths of the hexagonal versus the lengths of the square lattice is shown to be true. The proof makes use of results from (computational) prime number theory. Using an identity due to Selberg, it is shown that, in principle, the conjecture can be resolved without using computational prime number theory. By our approach, however, this would require a ...
متن کاملPolygonal polyominoes on the square lattice
We study a proper subset of polyominoes, called polygonal polyominoes, which are defined to be self-avoiding polygons containing any number of holes, each of which is a self-avoiding polygon. The staircase polygon subset, with staircase holes, is also discussed. The internal holes have no common vertices with each other, nor any common vertices with the surrounding polygon. There are no ‘holes-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2015
ISSN: 1042-9832
DOI: 10.1002/rsa.20620